package leetcode.weekly.week313;

//Solution1Test
public class Solution1 {

	public int commonFactors(int a, int b) {
		int ans = 0;
		for (int i = 1; i <= Math.min(a, b); i++) {
			if ((a % i) == 0 && (b % i) == 0) {
				ans++;
			}
		}
		return ans;
	}
}
